Item request has been placed!

Item request cannot be made.

Processing Request

نتائج البحث

Display Settings

النتائج لكل صفحة: 10

Sort By: Relevance

فلترة النتائج

فلترة بواسطة : موضوع Subject : 0202 electrical engineering, electronic engineering, information engineering

إعادة تعيين خيارات الفبترة

Item request has been placed!

Item request cannot be made.

Processing Request

Algorithms to compute the Burrows-Wheeler Similarity Distribution

Authors : Felipe A. Louza; Guilherme P. Telles; Simon Gog

Subjects: FOS: Computer and information sciences; COMPUTABILIDADE E COMPLEXIDADE; General Computer Science

Source: Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)Universidade de São Paulo (USP)instacron:USP

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

DICOM compression and decompression method using double cone

Authors : Marcos Soares de Oliveira; João Batista Ferreira Neto; Arata Andrade Saraiva

Subjects: Decompression; decompression; Similarity (geometry)

Source: Research, Society and Development, Vol 9, Iss 9, Pp e882998032-e882998032 (2020)Research, Society and Development; Vol. 9 No. 9; e882998032Research, Society and Development; Vol. 9 Núm.

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

Complexity results for probabilistic answer set programming

Authors : Fabio Gagliardi Cozman; Denis Deratani Mauá

Subjects: Partial interpretation; Probabilistic logic programming; Interpretation (logic)

Source: Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)Universidade de São Paulo (USP)instacron:USP

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference

Authors : Fabio Gagliardi Cozman; Denis Deratani Mauá

Subjects: Theoretical computer science; COMPUTABILIDADE E COMPLEXIDADE; Computational complexity theory

Source: Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)Universidade de São Paulo (USP)instacron:USP

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

The Complexity of Bayesian Networks Specified by Propositional and Relational Languages

Authors : Fabio Gagliardi Cozman; Denis Deratani Mauá

Subjects: FOS: Computer and information sciences; Average-case complexity; Linguistics and Language

Source: Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)Universidade de São Paulo (USP)instacron:USP

تفاصيل العنوان

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي